Location:
Search - Memory LRU
Search list
Description: LRU页面置换算法模拟,LRU置换算法虽然是一种比较好的算法，但要求系统有较多的支持硬件。为了了解一个进程在内存中的各个页面各有多少时间未被进程访问，以及如何快速地知道哪一页是最近最久未使用的页面.-LRU algorithm simulation replacement pages, the LRU algorithm replacement is a better algorithm, but requires a system with more hardware support. In order to understand a process in the memory of all pages is not how much time each process visit, and how fast to know which pages are the most recent time on the pages.
Platform: |
Size: 11592 |
Author: 22 |
Hits:
Description: 操作系统中 的 存储管理 LRU 算法模拟实现-OS storage management LRU algorithm simulation
Platform: |
Size: 1700 |
Author: 静水 |
Hits:
Description: LRU(最近最少使用算法) and MRU(最近最常使用算法)所谓的LRU(Least recently used)算法的基本概念是:当内存的剩余的可用空间不够时,缓冲区尽可能的先保留使用者最常使用的数据,换句话说就是优先清除”较不常使用的数据”,并释放其空间-LRU (least recently used algorithm) and MRU (most recently used) algorithm called LRU ( Least recently used) algorithm is the basic concept : When the memory of the remaining available space is insufficient, the first buffer as possible to retain the most common users of the data used, In other words priority is to eliminate the "more rarely use the data," and the release of its space
Platform: |
Size: 6388 |
Author: 张义平 |
Hits:
Description: 模拟操作系统虚拟存储中的页面置换算法采用FIFO算法和LRU算法-simulation operating system virtual memory pages the algorithm used FIFO replacement algorithm and LRU algorithm
Platform: |
Size: 6834 |
Author: 杨鼎新 |
Hits:
Description: 掌握内存管理的页面淘汰算法 输入可用内存页面数和一个作业访问逻辑页号的序列，分别给存FIFO、LRU算法的缺页中断率（注：算法原理实现，不要求实际页面）。-master memory management algorithm pages out of the importation of a few pages available memory and a logic operation visit pages of the sequence, kept FIFO, the LRU algorithm missing pages interrupt rate (Note : The principles of achieving algorithm that does not require the actual pages).
Platform: |
Size: 6144 |
Author: 施委 |
Hits:
Description: 模拟操作系统虚拟存储中的页面置换算法采用FIFO算法和LRU算法-simulation operating system virtual memory pages the algorithm used FIFO replacement algorithm and LRU algorithm
Platform: |
Size: 248832 |
Author: 杨鼎新 |
Hits:
Description: 基本算法思想 OPT：该算法的基本思想是用二维数组page2[40][2] 的第一列存储装入内存的页面，而第二列用作标记位计数器。每当发生缺页时，就从内存中调出一页，首先将内存中的页面一一与要调入内存中的页面之后的页面比较，如果两个页面不相等，则内存中相应的页面的标记位计数器加一，直至到有相等的页面，则该页面的比较停止，再重复以上操作，直至内存中的页面全部比较完。然后找出内存中页面的标记位最大的页面，而该页就是要置换出来的页。 FIFO: 该算法的基本思想是用队列queue存储内存中的页面，队列的特点是先进先出，与该算法是一致的，所以每当发生缺页时，就从队头删除一页，即队头指针加一，而从队尾加入缺页，队尾指针加一。 LRU: 该算法的基本思想是用二维数组page2[40][2] 的第一列存储装入内存的页面，而第二列用作标记位计数器。每当使用页面时，该页面的标记位计数器加一。发生缺页时，就从内存中页面标记最小的一页，调出该页，并且该页后面的页面在数组中的位置前移，而缺页就放在数组后面。-basic algorithm thinking OPT : The basic idea of the algorithm is a two-dimensional array page2 [40] [2], the first storage pages loaded into memory, and the second for the markers out counter. Whenever there are missing pages, from memory a redeployment, the first memory pages on January 1 and transferred to the memory page after page, two pages, if not equal, then the corresponding memory pages marked increase a bit counter, until the equivalent of a page, the page more stop and then to repeat the operation, until the memory of all the pages compared End. Then find memory pages marking the largest-page, the page is to the replacement page. FIFO : The basic idea of the algorithm is used queue queue storage memory pages, and the queue is FIFO features, and the algorithm is the same, so whe
Platform: |
Size: 26624 |
Author: 何泽荣 |
Hits:
Description: 任务 设计一个虚拟存储区和内存工作区，并使用下述算法计算访问命中率。 （1）先进先出的算法（FIFO） （2）最近最少使用算法（LRU） （3）最佳淘汰算法（OPT） （4）最少访问页面算法（LFU） （5）最近最不经常使用算法（NUR） 命中率=（1 – 页面失效次数）/页地址流长度-mission design a virtual memory storage area and the work area and to use the following algorithm to visit the hit rate. (1) FIFO algorithm (FIFO) (2) at least recently used algorithm (LRU) (3) eliminated the best algorithm (OPT) (4) at least visit pages algorithm (LFU) (5) most recently used algorithm (NUR) life China rate = (1-pages failure number)/page-length addre
Platform: |
Size: 2048 |
Author: 东方少秋 |
Hits:
Description: LRU页面置换算法模拟,LRU置换算法虽然是一种比较好的算法，但要求系统有较多的支持硬件。为了了解一个进程在内存中的各个页面各有多少时间未被进程访问，以及如何快速地知道哪一页是最近最久未使用的页面.-LRU algorithm simulation replacement pages, the LRU algorithm replacement is a better algorithm, but requires a system with more hardware support. In order to understand a process in the memory of all pages is not how much time each process visit, and how fast to know which pages are the most recent time on the pages.
Platform: |
Size: 11264 |
Author: 22 |
Hits:
Description: 最佳页面置换算法，FIFO，LRU的仿真。页面调用和置换过程有动态显示。内存分配页面数目和页面引用串的长度可以进行人工交互输入。
-best pages replacement algorithm, FIFO, the LRU simulation. Page calls and replacement process is dynamic display. Memory allocation of the number of pages and pages cited the length of string can be artificial interactive input.
Platform: |
Size: 238592 |
Author: 刘利辉 |
Hits:
Description: 高速缓存算法类.英文介绍:
The Cache class implements a simple caching mechanism with "least
recently used" (LRU) replacement. It is useful for cases in which you
have some memory to spare and you wish to speed up access to frequently
used resources, of which not all will fit into available memory. Thus,
you know you have room in memory for more than 1 resource, but you don t
have room to store all possible resources in memory, so you want to
store some of them. The Cache class helps you to manage the storage in
memory of some subset of all possible resources and therefore speed up
your resource accesses. -cache algorithm category. English presentations : The Cache class implements a simple caching mec mechanism with the "least recently used" (LRU) replac ement. It is useful for cases in which you have so me memory to spare and you wish to speed up access to frequently used resources. not all of which will fit into available memory. Thus, you know you have room in memory for more than a re source. but you don t have room to store all possible RESO ; in memory, so you want to store some of them. The Cache class helps you to manage the storage in memory of some subset of all possible resources and therefore speed up your resource accesses.
Platform: |
Size: 8192 |
Author: 洋场河 |
Hits:
Description: The programe is emluator the memory arithmatic---FIFO LRU ...in the operate system.-emluator the memory arithm atic--- FIFO LRU operate ... in the system.
Platform: |
Size: 1024 |
Author: yt |
Hits:
Description: 操作系统中 的 存储管理 LRU 算法模拟实现-OS storage management LRU algorithm simulation
Platform: |
Size: 1024 |
Author: 静水 |
Hits:
Description: LRU(最近最少使用算法) and MRU(最近最常使用算法)所谓的LRU(Least recently used)算法的基本概念是:当内存的剩余的可用空间不够时,缓冲区尽可能的先保留使用者最常使用的数据,换句话说就是优先清除”较不常使用的数据”,并释放其空间-LRU (least recently used algorithm) and MRU (most recently used) algorithm called LRU ( Least recently used) algorithm is the basic concept : When the memory of the remaining available space is insufficient, the first buffer as possible to retain the most common users of the data used, In other words priority is to eliminate the "more rarely use the data," and the release of its space
Platform: |
Size: 6144 |
Author: 张义平 |
Hits:
Description: 虚拟内存中的LRU算法，有需要的可以拿去参考一下啊-Virtual memory in the LRU algorithm, there is a need to be taken to refer to the ah
Platform: |
Size: 46080 |
Author: 海阔天空 |
Hits:
Description: java语言编写的，模拟LRU内存调换算法的程序-java language, simulated LRU memory replacement algorithm procedure
Platform: |
Size: 1024 |
Author: lilun |
Hits:
Description: 1、用C语言实现最近最久未使用（LRU）置换算法。
2、了解内存分页管理策略
3、掌握调页策略
4、掌握一般常用的调度算法
5、选取调度算法中的典型算法，模拟实现
-1, using C language long used the most recent (LRU) replacement algorithm. 2, to understand the memory management strategy page 3, page strategy master tune 4, master scheduling algorithms commonly used 5, select the scheduling algorithm of a typical algorithm, simulation
Platform: |
Size: 12288 |
Author: 汪 |
Hits:
Description: 操作系统课程设计内存调度LRU，FIFO，OPT算法的页面置换-Curriculum design scheduling operating system memory LRU, FIFO, OPT page replacement algorithm
Platform: |
Size: 50176 |
Author: immortal |
Hits:
Description: java模拟操作系统的lru虚拟内存换页算法-java simulation of the operating system virtual memory paging algorithm lru
Platform: |
Size: 2048 |
Author: Benmerin |
Hits:
Description: 编程实现LRU算法或CLOCK/改进算法等置换算法（二选一），模拟实现虚拟存储器的地址变换过程。-Programming LRU algorithm or CLOCK/improved algorithms replacement algorithm (alternative), analog virtual memory address translation process.
Platform: |
Size: 141312 |
Author: 李朗 |
Hits: